Fast Sorting of Weyl Sequences Using Comparisons

On New Sorting-Based Lossless Motion Estimation Algorithms

Block motion estimation represents a cpu-intensive task in video encoding and many fast algorithms have been developed to improve the searching and matching phases. A milestone within the lossless approach is partial distortion elimination (PDE/SpiralPDE) in which distortion is the difference between the block to be coded and the candidate prediction block. In this paper we show that contributi...

Fast Stable In - Place Sorting with O ( n ) Data Moves 1

Until recently, it was not known whether it was possible to sort stably (i.e., keeping equal elements in their initial order) an array of n elements using only O(n) data moves and O(1) extra space. In [13] an algorithm was given to perform this task in O(n2) comparisons in the worst case. Here, we develop a new algorithm for the problem that performs only O(n1+ε) comparisons (0 < ε ≤ 1 is any f...

Homomorphic Rank Sort Using Surrogate Polynomials

In this paper we propose a rank based algorithm for sorting encrypted data using monomials. Greedy Sort is a sorting technique that achieves to minimize the depth of the homomorphic evaluations. It is a costly algorithm due to excessive ciphertext multiplications and its implementation is cumbersome. Another method Direct Sort has a slightly deeper circuit than Greedy Sort, nevertheless it is s...

A Necessary Condition for Weyl-Heisenberg Frames

IfI - 06 - 10 Clausthal - Zellerfeld 2006

In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p stream processor units, this approach achieves the optimal time complexity O((n log n)/p). While this makes our approach competitive with common sequential sorting algorithms not only from a theoretical viewpoint, it is als...